A Decidable Confluence Test for Cognitive Models in ACT-R
نویسندگان
چکیده
Computational cognitive modeling investigates human cognition by building detailed computational models for cognitive processes. Adaptive Control of Thought – Rational (ACT-R) is a rule-based cognitive architecture that offers a widely employed framework to build such models. There is a sound and complete embedding of ACT-R in Constraint Handling Rules (CHR). Therefore analysis techniques from CHR can be used to reason about computational properties of ACT-R models. For example, confluence is the property that a program yields the same result for the same input regardless of the rules that are applied. In ACT-R models, there are often cognitive processes that should always yield the same result while others e.g. implement strategies to solve a problem that could yield different results. In this paper, a decidable confluence criterion for ACT-R is presented. It allows to identify ACT-R rules that are not confluent. Thereby, the modeler can check if his model has the desired behavior. The sound and complete translation of ACT-R to CHR from prior work is used to come up with a suitable invariant-based confluence criterion from the CHR literature. Proper invariants for translated ACT-R models are identified and proven to be decidable. The presented method coincides with confluence of the original ACT-R models.
منابع مشابه
Translation of Cognitive Models from ACT-R to Constraint Handling Rules
Cognitive architectures are used to abstract and simplify the process of computational cognitive modeling. The popular cognitive architecture ACT-R has a well-defined psychological theory, but lacks a formalization of its computational system. This inhibits computational analysis of cognitive models, e.g. confluence or complexity analysis. In this paper we present a source to source transformat...
متن کاملObservable Confluence for Constraint Handling Rules
Constraint Handling Rules (CHRs) are a powerful rule based language for specifying constraint solvers. Critical for any rule based language is the notion of confluence, and for terminating CHRs there is a decidable test for confluence. But many CHR programs that in practice are confluent fail this confluence test. The problem is that the states that illustrate non-confluence are not reachable i...
متن کاملComparing the Effectiveness of Schema Therapy with Acceptance and Commitment Therapy (ACT) on Cognitive Avoidance in GAD patients
Objective: This study aimed to compare the effectiveness of schema therapy with acceptance and commitment therapy with exposure techniques on cognitive avoidance in female patients with generalized anxiety disorder. Methods: 10 women with generalized anxiety disorder were selected through purposeful sampling with Structured Clinical Interview for DSM Disorders (SCID-5). To determine the absenc...
متن کاملRelative Undecidability in Term Rewriting Part 2: The Confluence Hierarchy
For a hierarchy of properties of term rewriting systems related to confluence we prove relative undecidability, i.e., for implications X ⇒ Y in the hierarchy the property X is undecidable for term rewriting systems satisfying Y . For some of the implications either X or ¬X is semi-decidable, for others neither X nor ¬X is semi-decidable. We prove most of these results for linear term rewrite sy...
متن کاملNeuro-ACT Cognitive Architecture Applications in Modeling Driver’s Steering Behavior in Turns
Cognitive Architectures (CAs) are the core of artificial cognitive systems. A CA is supposed to specify the human brain at a level of abstraction suitable for explaining how it achieves the functions of the mind. Over the years a number of distinct CAs have been proposed by different authors and their limitations and potentials were investigated. These CAs are usually classified as symbolic and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017